Proceedings Sixth Workshop on Proof eXchange for Theorem Proving
نویسندگان
چکیده
منابع مشابه
Proof Exchange for Theorem Proving — Second International Workshop , PxTP 2012 Manchester , UK June 30 , 2012
This article shows that theory exploration arises naturally from the need to progressively modify applied formal theories, especially those underpinning deployed systems that change over time or need to be attack-tolerant. Such formal theories require us to explore a problem space with a proof assistant and are naturally dynamic. The examples in this article are from our on-going decade-long ef...
متن کاملThird International Workshop on Proof Exchange for Theorem Proving, PxTP 2013, Lake Placid, NY, USA, June 9-10, 2013
The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the familiar cannonball arrangement. The proof of the Kepler conjecture was announced in 1998, but it went several years without publication because of the lingering doubts of referees about the correctness of the proof. In response to these publication hurdles,...
متن کاملWorkshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005) Workshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005)
This paper introduces a method for formal and symbolic analysis of single–input single–output continuous–time control systems. The method is based on traditional control engineering analysis using Nichols plots and thus focuses on the properties of gain (amplitude) and phase–shift. We reduce Nichols plot requirements to a decision problem and present a procedure to decide problems of this type....
متن کاملProof Documents for Automated Origami Theorem Proving
A proof document for origami theorem proving is a record of entire process of reasoning about origami construction and theorem proving. It is produced at the completion of origami theorem proving as a kind of proof certificate. It describes in detail how the whole process of an origami construction and the subsequent theorem proving are carried out in our computational origami system. In partic...
متن کاملProof-Checking, Theorem-Proving, and Program Verification
This article consists of three parts: a tutorial introduction to a computer program that proves theorems by induction; a brief description of recent applications of that theorem-prover; and a discussion of several nontechnical aspects of the problem of building automatic theorem-provers. The theorem-prover described has proved theorems such as the uniqueness of prime factorizations, Fermat’s th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.301.0